Optimal matrix-segmentation by rectangles
نویسندگان
چکیده
منابع مشابه
An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles
In this paper we face the problem of computing a conservative approximation of a set of isothetic rectangles in the plane by means of a pair of enclosing isothetic rectangles. We propose an O(n log n) time algorithm for nding, given a set M of n isothetic rectangles, a pair of isothetic rectangles (s; t) such that s and t enclose all rectangles of M and area(s) + area(t) is minimal. Moreover we...
متن کاملAn optimal algorithm for reporting visible rectangles
We consider the following problem as defined by Grove et al. [5]: Given a set of n isothetic rectangles in 3D space determine the subset of rectangles that are not completely hidden. We present an optimal algorithm for this problem that runs in O(nlogn) time and O(n) storage. Our result is an improvement over the one of Grove et al. by a logarithmic factor in storage and is achieved by using a ...
متن کاملNear optimal-partitioning of rectangles and prisms
This paper focuses on the following problems: Problem 1 Given an axis parallel rectangle, how do you cut it in k equal area pieces such that the total length of the cuts is minimum? What are the properties of an optimal cut? Problem 2 Given an axis parallel prism, how do you cut it in k equal volume pieces such that the total surface area of the cuts is minimum? What are the properties of an op...
متن کاملOptimal Packing of High-Precision Rectangles
The rectangle-packing problem consists of finding an enclosing rectangle of smallest area that can contain a given set of rectangles without overlap. Our new benchmark includes rectangles of successively higher precision, challenging the previous state-of-the-art, which enumerates all locations for placing rectangles, as well as all bounding box widths and heights up to the optimal box. We inst...
متن کاملOptimal spanners for axis-aligned rectangles
The dilation of a geometric graph is the maximum, over all pairs of points in the graph, of the ratio of the Euclidean length of the shortest path between them in the graph and their Euclidean distance. We consider a generalized version of this notion, where the nodes of the graph are not points but axis-parallel rectangles in the plane. The arcs in the graph are horizontal or vertical segments...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.12.008